Checking Algorithms for Pure Type Systems
نویسندگان
چکیده
منابع مشابه
Type-checking injective pure type systems
Injective Pure Type Systems form a large class of Pure Type Systems for which one can compute by purely syntactic means two sorts elmt(?jM) and sort(?jM), where ? is a pseudo-context and M is a pseudo-term, and such that for every sort s, ? ` M : A ^ ? ` A : s) elmt(?jM) = s ? ` M : s) sort(?jM) = s By eliminating the problematic clause in the (abstraction) rule in favour of constraints over el...
متن کاملA Hybrid Meta-heuristic Approach to Cope with State Space Explosion in Model Checking Technique for Deadlock Freeness
Model checking is an automatic technique for software verification through which all reachable states are generated from an initial state to finding errors and desirable patterns. In the model checking approach, the behavior and structure of system should be modeled. Graph transformation system is a graphical formal modeling language to specify and model the system. However, modeling of large s...
متن کاملThe Semi-Full Closure of Pure Type Systems
We show that every functional Pure Type System may be extended to a semi-full Pure Type System. Moreover, the extension is conservative and preserves weak normalization. Based on these results, we give a new, conceptually simple type-checking algorithm for functional Pure Type Systems.
متن کاملPure Discrete Spectrum for One-dimensional Substitution Systems of Pisot Type
We consider two dynamical systems associated with a substitution of Pisot type: the usual Z-action on a sequence space, and the R-action, which can be defined as a tiling dynamical system or as a suspension flow. We describe procedures for checking when these systems have pure discrete spectrum (the “balanced pairs algorithm” and the “overlap algorithm”) and study the relation between them. In ...
متن کاملOn the Role of Type Decorations in the Calculus of Inductive Constructions
In proof systems like Coq [15], proof-checking involves comparing types modulo β-conversion, which is potentially a time-consuming task. Significant speed-ups are achieved by compiling proof terms, see [8]. Since compilation erases some type information, we have to show that convertibility is preserved by type erasure. This article shows the equivalence of the Calculus of Inductive Construction...
متن کامل